Cactus Wheel

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cytochrome oxidase of cactus.

The present autlhors have isolated a particleassociated cytochrome oxidase from the phylloclades of cactus plant and studied its kinetics. To our knowledge, this is the first report on cytoclhrome oxidase from a crassulacean plant. Tender phylloclades of Nopalea dejecta SalmDyck were ground with 5 volumes of chilled medium in a Waring Blendor operated first at low speed for 25 seconds and then ...

متن کامل

Broadcasting on cactus graphs

Broadcasting is the process of dissemination of a message from one vertex (called originator) to all other vertices in the graph. This task is accomplished by placing a sequence of calls between neighboring vertices, where one call requires one unit of time and each call involves exactly two vertices. Each vertex can participate in one call per one unit of time. Determination of the broadcast t...

متن کامل

Cactus-Pear Juices

This paper presents a review of cactus-pear juice production. Its technological characteristics are considered, as well as the main difficulties in obtaining high-quality juice. Acidity, pigments, aroma, and other components play an important role in the cactus pear juice processing. Betalain and chlorophyll are present in purple and green cactus pear juices, and heat treatment of the juices af...

متن کامل

Sliding Tokens on a Cactus

Given two independent sets I and J of a graph G, imagine that a token (coin) is placed on each vertex in I. Then, the Sliding Token problem asks if one could transforms I to J using a sequence of elementary steps, where each step requires sliding a token from one vertex to one of its neighbors, such that the resulting set of vertices where tokens are placed still remains independent. In this pa...

متن کامل

Some Algorithms on Cactus Graphs

A cactus graph is a connected graph in which every block is either an edge or a cycle. In this paper we give a brief idea how to design some optimal algorithms on cactus graphs in O(n) time, where n is the total number of vertices of the graph. The cactus graph has many applications in real life problems, specially in radio communication system.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Clinical Chemistry

سال: 2010

ISSN: 0009-9147,1530-8561

DOI: 10.1373/clinchem.2009.142067